Concordance-based Kendall's Correlation for Computationally-Light vs. Computationally-Heavy Centrality Metrics: Lower Bound for Correlation

Evaluation of Correlation Measures for Computationally-Light vs. Computationally-Heavy Centrality Metrics on Real-World Graphs

We identify three different levels of correlation (pairwise relative ordering, network-wide ranking and prediction through linearity) that could be assessed between a computationally-light centrality metric and a computationally-heavy centrality metric for real-world networks. The Kendall's concordance-based correlation measure could be used to quantitatively assess how well we could consider t...

A Computationally Efficient Approximation of Beta Centrality

Much attention has been focused on developing methods of assessing centrality and power in networks, with particular interest focused on recursive measures that view the status of a node as a function of the status of other nodes. Although such measures have been widely adopted in both academic research and commercial applications, they are computationally intensive and subject to misspecificat...

A Binary Search Algorithm for Correlation Study of Decay Centrality vs. Degree Centrality and Closeness Centrality

Results of correlation study (using Pearson's correlation coefficient, PCC) between decay centrality (DEC) vs. degree centrality (DEG) and closeness centrality (CLC) for a suite of 48 real-world networks indicate an interesting trend: PCC(DEC, DEG) decreases with increase in the decay parameter δ (0 < δ < 1) and PCC(DEC, CLC) decreases with decrease in δ. We make use of this trend of monotonic ...

A Lower Bound for Time Correlation of Lattice Gases

The lattice gas model in equilibrium is considered. We give a lower bound of the density-density time correlation for large time, which involves the bulk diffusion matrix in a physically natural way.

Computationally Based Measures of Amine Azide Basicity and Their Correlation With Hypergolic Ignition Delays